Yet another breakout inspired infeasible subset detection in constraint satisfaction problem
نویسندگان
چکیده
In [1], Eisenberg and Faltings proposed a breakout [2] based hybrid approach to detect infeasible subset (IS) in constraint satisfaction problems. In this paper, we adopted this algorithm as a preprocessing procedure to reduce the over-constrained constraint satisfaction problem. Then a three procedures hybrid approach is employed to detect the irreducible infeasible subset (IIS) of identified IS. The approach consists of three procedures critical constraint locating, critical constraint extending and critical constraint subsets satisfiability testing. The extent of the subproblem is based on the first located critical constraint and is ended while it cannot be satisfied by a Tabu Search incomplete search algorithm. Finally, the MAC (Maintaining Arc Consistency during search) method provides the infeasibility of the extracted subproblem. By adopting a hybrid approach, the tractability of satisfiability testing of real world applications becomes realistic. The experimental results demonstrate the effectiveness of the method.
منابع مشابه
The distributed breakout algorithms
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constraint satisfaction problem (CSP). The basic idea of these algorithms is for agents to repeatedly improve their tentative and flawed sets of assignments for variables simultaneously while communicating such tentative set...
متن کاملSecond International Conference on Multiagent Systems 1996 Distributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems
This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called the distributed breakout algorithm, which is inspired by the breakout algorithm for solving centralized CSPs. In this algorithm, each agent tries to optimize its evaluation value (the number of constraint violations) by exchanging its current value and the possible amount of it...
متن کاملDistributed Breakout Algorithm for Solving Distributed Constraint Satisfaction Problems
This paper presents a new algorithm for solving distributed constraint satisfaction problems (distributed CSPs) called the distributed breakout algorithm, which is inspired by the breakout algorithm for solving centraiized CSPs. In this algorithm, each agent tries to optimize its evaluation value (the number of constraint violations) by exchanging its current value and the possible amount of it...
متن کاملDisBO-wd: a Distributed Constraint Satisfaction Algorithm for Coarse-Grained Distributed Problems
We present a distributed iterative improvement algorithm for solving coarse-grained distributed constraint satisfaction problems (DisCSPs). Our algorithm is inspired by the Distributed Breakout for coarse-grained DisCSPs where we introduce a constraint weight decay and a constraint weight learning mechanism in order to escape local optima. We also introduce some randomisation in order to give t...
متن کاملDistributed Partial Constraint Satisfaction Problem
Many problems in multi-agent systems can be described as Distributed Constraint Satisfaction Problems (Distributed CSPs), where the goal is to nd a set of assignments to variables that satis es all constraints among agents. However, when real-life application problems are formalized as Distributed CSPs, they are often over-constrained and have no solution that satis es all constraints. This pap...
متن کامل